منابع مشابه
Solving tough problems with games.
The Foldit Void Crushers Group soundsmore like a noisy art-rock band than a research team. However, there it is, listed as coauthor of an article in the October 2011 issue of Nature Structural & Molecular Biology. The group is made up of online game players who had a critical role in the paper’s complex achievement—solving a protein structure that had vexed biologists for a decade. Similar appe...
متن کاملSolving Min-Max Problems with Applications to Games
We refine existing general network optimization techniques, give new characterizations for the class of problems to which they can be applied, and show that they can also be used to solve various twoplayer games in almost linear time. Among these is a new variant of the network interdiction problem, where the interdictor wants to destroy high-capacity paths from the source to the destination us...
متن کاملSolving matrix games with hesitant fuzzy pay-offs
The objective of this paper is to develop matrix games with pay-offs of triangular hesitant fuzzy elements (THFEs). To solve such games, a new methodology has been derived based on the notion of weighted average operator and score function of THFEs. Firstly, we formulate two non-linear programming problems with THFEs. Then applying the score function of THFEs, we transform these two problems in...
متن کاملSolving infinite games with bounds
We investigate the existence and the complexity of computing and implementing optimal winning strategies for graph games of infinite duration. Parameterized linear temporal logics are extensions of Linear Temporal Logic (LTL) by temporal operators equipped with variables for time bounds. In model-checking, such specifications were introduced as “PLTL” by Alur et al. and as “PROMPT-LTL” by Kupfe...
متن کاملSolving CSPs with Naming Games
Constraint solving problems (CSPs) represent a formalization of an important class of problems in computer science. We propose here a solving methodology based on the naming games. The naming game was introduced to represent N agents that have to bootstrap an agreement on a name to give to an object. The agents do not have a hierarchy and use a minimal protocol. Still they converge to a consist...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings of the National Academy of Sciences
سال: 2013
ISSN: 0027-8424,1091-6490
DOI: 10.1073/pnas.1306643110